Relations Versus Functions at the Foundations of Logic: Type-Theoretic Considerations

نویسندگان

  • Paul E. Oppenheimer
  • Edward N. Zalta
چکیده

Though Frege was interested primarily in reducing mathematics to logic, he succeeded in reducing an important part of logic to mathematics by defining relations in terms of functions. By contrast, Whitehead & Russell reduced an important part of mathematics to logic by defining functions in terms of relations (using the definite description operator). We argue that there is a reason to prefer Whitehead & Russell’s reduction of functions to relations over Frege’s reduction of relations to functions. There is an interesting system having a logic that can be properly characterized in relational but not in functional type theory. This shows that relational type theory is more general than functional type theory. The simplification offered by Church in his functional type theory is an over-simplification: one can’t assimilate predication to functional application. ∗This paper is published in the Journal of Logic and Computation, 21 (2011): 351– 374. At the end of the 3rd paragraph of Section 2.2, this preprint adds a left and right parenthesis, in red, to the logical type assigned to the Π function, thereby correcting an error. The authors would like to thank Uri Nodelman for his observations on the first draft of this paper. We’d also like to thank Bernard Linsky for observations on the second draft, which led us to reconceptualize the significance of our results within a more historical context. We’d also like to acknowledge one of the referees of this journal, whose comments led us to clarify and better document the claims in the paper. Paul Oppenheimer and Edward N. Zalta 2

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Relations vs. Functions at the Foundations of Logic: Type-Theoretic Considerations∗

Though Frege was interested primarily in reducing mathematics to logic, he succeeded in reducing an important part of logic to mathematics by defining relations in terms of functions. By contrast, Whitehead & Russell reduced an important part of mathematics to logic by defining functions in terms of relations (using the definite description operator). We argue that there is a reason to prefer W...

متن کامل

Some Proof Theoretic Considerations in Intuitionistic Propositional Modal Logic

Formalizations of different logics can serve as foundations for reasoning about various properties of both hardware and software systems. Intuitionistic modal logics, featuring operators encoding possibility and necessity, have recently found applications in hardware verification as well as proposed type systems for staged computation and distributed computing. We propose several novel sequent ...

متن کامل

New Foundations for Fixpoint Computations: FIX-Hyperdoctrines and the FIX-Logic

This paper introduces a new higher-order typed constructive predicate logic for fixpoint computations, which exploits the categorical semantics of computations introduced by Moggi [Mog 89] and contains a version of Martin Löf’s ‘iteration type’ [MarL 83]. The type system enforces a separation of computations from values. The logic contains a novel form of fixpoint induction and can express part...

متن کامل

The Referential Basis of Abduction and Logic

AI has often mistreated logic and abduction.A closer view at the historical roots of logic and at the system theoretic structure of logical modeling reveals that the foundations of logic lie in a science of argumentation rather than reasoning. The basis of such a science is a clarifcation of the term “argument” that also leads to a reduction of the semantics of natural language. In logic, the r...

متن کامل

New Foundations for Fixpoint Computations

This paper introduces a new higher-order typed constructive predicate logic for fixpoint computations, which exploits the categorical semantics of computations introduced by Moggi [8] and contains a strong version of Martin-Lof’s ‘iteration type’ [ll]. The type system enforces a separation of computations from values. The logic contains a novel form of fixpoint induction and can express partial...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Log. Comput.

دوره 21  شماره 

صفحات  -

تاریخ انتشار 2011